Modeling Coevolutionary Genetic Algorithms on Two-Bit Landscapes: Random Partnering
نویسندگان
چکیده
A model of coevolutioinary genetic algorithms (COGA) consisting of two populations coevolving on two-bit landscapes is investigated in terms of the effects of random partnering strategy, different population updating schemes, and changes in mutation rate and evolution rate. The analytical and numerical approaches showed that even in such a simple model, the dynamics can change dramatically with different evolutionary scenarios in such an extent that deserves our attention from the point of view of algorithm design.
منابع مشابه
On the Application of Hierarchical Coevolutionary Genetic Algorithms: Recombination and Evaluation Partners
This paper examines the use of a hierarchical coevolutionary genetic algorithm under different partnering strategies. Cascading clusters of sub-populations are built from the bottom up, with higher-level sub-populations optimising larger parts of the problem. Hence higher-level sub-populations potentially search a larger search space with a lower resolution whilst lower-level sub-populations se...
متن کاملRandom Bit Climbers on Multiobjective MNK-Landscapes: Effects of Memory and Population Climbing
In this work we give an extension of Kauffman’s NKLandscapes to multiobjective MNK-Landscapes in order to study the effects of epistasis on the performance of multiobjective evolutionary algorithms (MOEAs). This paper focuses on the development of multiobjective random one-bit climbers (moRBCs). We incrementally build several moRBCs and analyze basic working principles of state of the art MOEAs...
متن کاملGenetic Algorithms on NK-Landscapes: Effects of Selection, Drift, Mutation, and Recombination
NK-Landscapes are stochastically generated fitness functions on bit strings, parameterized with N bits and K epistatic interactions between bits. The term epistasis describes nonlinearities in fitness functions due to changes in the values of interacting bits. Empirical studies have shown that the overall performance of random bit climbers on NK-Landscapes is superior to the performance of some...
متن کاملModeling Variation in Cooperative Coevolution Using Evolutionary Game Theory
Though coevolutionary algorithms are currently used for optimization purposes, practitioners are often plagued with difficulties due to the fact that such systems frequently behave in counter intuitive ways that are not well understood. This paper seeks to extend work which uses evolutionary game theory (EGT) as a form of dynamical systems modeling of coevolutionary algorithms in order to begin...
متن کاملPreliminary Study on the Performance of Multiobjective Evolutionary Algorithms with MNK-Landscapes
Epistasis and NK-Landscapes in the context of multiobjective evolutionary algorithms are almost unexplored subjects. Here we present an extension of Kauffman’s NK-Landscapes to multiobjective MNK-Landscapes in order to use them as a benchmark tool and as a mean to understand better the working principles of multiobjective evolutionary algorithms (MOEAs). In this work we present an elitist multi...
متن کامل